Threshold Cryptography Based on Asmuth-Bloom Secret Sharing
نویسندگان
چکیده
In this paper, we investigate how threshold cryptography can be conducted with the Asmuth-Bloom secret sharing scheme and present three novel function sharing schemes for RSA, ElGamal and Paillier cryptosystems. To the best of our knowledge, these are the first provably secure threshold cryptosystems realized using the Asmuth-Bloom secret sharing. Proposed schemes are comparable in performance to earlier proposals in threshold cryptography.
منابع مشابه
Multipartite Secret Sharing Based on CRT
Secure communication has become more and more important for system security. Since avoiding the use of encryption one by one can introduce less computation complexity, secret sharing scheme (SSS) has been used to design many security protocols. In SSSs, several authors have studied multipartite access structures, in which the set of participants is divided into several parts and all participant...
متن کاملFunction and Secret Sharing Extensions for Blakley and Asmuth-bloom Secret Sharing Schemes
FUNCTION AND SECRET SHARING EXTENSIONS FOR BLAKLEY AND ASMUTH-BLOOM SECRET SHARING SCHEMES İlker Nadi Bozkurt M.S. in Computer Engineering Supervisor: Assist. Prof. Dr. Ali Aydın Selçuk August, 2009 Threshold cryptography deals with situations where the authority to initiate or perform cryptographic operations is distributed amongst a group of individuals. Usually in these situations a secret s...
متن کاملOn the Asymptotic Idealness of the Asmuth-Bloom Threshold Secret Sharing Scheme
A necessary and sufficient condition for the asymptotic idealness of the AsmuthBloom threshold secret sharing scheme is proposed. Apart from this, a comprehensive analysis of the known variants of the Asmuth-Bloom threshold secret sharing scheme is provided, clarifying the security properties achieved by each of them.
متن کاملGeneral Secret Sharing Based on the Chinese Remainder Theorem with Applications in E-Voting
Threshold secret sharing based on the Chinese remainder theorem has been considered by Mignotte [23] and Asmuth and Bloom [1]. In this paper we demonstrate that the Chinese remainder theorem can be used for realizing more general access structures, as the compartmented or the weighted threshold ones. We also prove that there exist some non-weighted threshold access structures whose realizations...
متن کاملMultilevel Threshold Secret Image Sharing based on the Chinese Remainder Theorem
(t, n)-threshold secret sharing was first introduced by Shamir and Blakley separately in 1979. Apart from this, there are threshold secret sharing schemes which use the Chinese Remainder Theorem (CRT). The above mentioned are three of the most extensively researched tools used for designing a (t, n)-threshold secret sharing scheme. In this paper we propose a scheme for Multilevel Threshold Secr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006